Convergence for periodic Markov chains
نویسندگان
چکیده
Consider a discrete-time Markov chain (Xn : n > 0) ∼ Markov(λ, P ) with countable state space S. In the last lecture, we proved the following theorem for aperiodic Markov chains. Theorem (Aperiodic case). Assume P is irreducible and positive recurrent with unique invariant measure π. If, in addition, P is aperiodic, then P(Xn = j)→ πj as n→∞ for all j ∈ S. In particular, p (n) ij → πj as n→∞ for all i, j ∈ S.
منابع مشابه
Asymptotic Variance and Convergence Rates of Nearly-Periodic MCMC Algorithms
We consider nearly-periodic Markov chains, which may have excellent functional-estimation properties but poor distributional convergence rate. We show how simple modifications of the chain (involving using a random number of iterations) can greatly improve the distributional convergence of the chain. We prove various theoretical results about convergence rates of the modified chains. We also co...
متن کاملOptimal P{cyclic Sor
Our purpose in this paper is to extend p{cyclic SOR theory to consistent singular systems and to apply the results to the solution of large scale systems arising, e.g., in queueing network problems in Markov analysis. Markov chains and queueing models lead to structured singular linear systems and are playing an increasing role in the understanding of complex phenomena arising in computer, comm...
متن کاملA Short Note on Stationary Distributions of Unichain Markov Decision Processes
This work was supported in part by the the Austrian Science Fund FWF (S9104-N04 SP4) and the IST Programme of the European Community, under the PASCAL Network of Excellence, IST-2002-506778. This publication only reflects the authors’ views. 1Actually, for aperiodic Markov chains one has even μ0P n → μ, while the convergence behavior of periodic Markov chains can be described more precisely. Ho...
متن کاملA Local Limit Theorem for a Family of Non-reversible Markov Chains
Abstract. By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are not reversible, have little symmetry, do not have uniform stationary distributions, and can be nearly periodic, prior general bounds on rates of c...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017